Adaptive Task and Resource Allocation in Multi-Agent Systems

نویسندگان

  • S. Shaheen
  • Michael Wooldridge
چکیده

ABSTRACT In this paper, we present an adaptive organizational poli y for multi-agent systems alled tra e. tra e allows a olle tion of multi-agent organizations to dynami ally allo ate tasks and resour es between themselves in order to eÆ iently pro ess an in oming stream of task requests. tra e is intended to ope with environments in whi h tasks have time onstraints, and environments that are subje t to load variations. tra e is made up of two key elements: the task allo ation proto ol (tap) and the resour e allo ation proto ol (rap). The tap allows agents to ooperatively allo ate their tasks to other agents with the apability and opportunity to su essfully arry them out. As requests arrive arbitrarily, at any instant, some organizations ould have surplus resour es while others ould be ome overloaded. In order to minimize the number of lost requests aused by an overload, the allo ation of resour es to organizations is hanged dynami ally by the resour e allo ation proto ol (rap), whi h uses ideas from omputational market systems to allo ate resour es (in the form of problem solving agents) to organizations. We begin by formally de ning the task allo ation problem, and show that it is npomplete, and hen e that entralized solutions to the problem are unlikely to be feasible. We then introdu e the task and resour e allo ation proto ols, fo ussing on the way in whi h resour es are allo ated by the rap. We then present some experimental results, whi h show that tra e exhibits high performan e despite unanti ipated hanges in the environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning

In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...

متن کامل

Adaptive call admission control and resource allocation in multi server wireless/cellular network

The ever increasing demand of the subscribers has put pressure on the capacity of wireless networks around the world. To utilize the scare resources, in the present paper we propose an optimal allocation scheme for an integrated wireless/cellular model with handoff priority and handoff guarantee services. The suggested algorithm optimally allocates the resources in each cell and dynamically adj...

متن کامل

Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

متن کامل

Adaptive neural control of nonlinear fractional order multi- agent systems in the presence of error constraintion

In this paper, the problem of fractional order multi-agent tracking control problem is considered. External disturbances, uncertainties, error constraints, transient response suitability and desirable response tracking problems are the challenges in this study. Because of these problems and challenges, an adaptive control and neural estimator approaches are used in this study. In the first part...

متن کامل

Adaptive Neural Network Method for Consensus Tracking of High-Order Mimo Nonlinear Multi-Agent Systems

This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...

متن کامل

Optimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001